Binary Partitions Revisited
نویسندگان
چکیده
The restricted binary partition function bk(n) enumerates the number of ways to represent n as n = 2a0 + 2a1 + · · ·+ 2aj with 0 ≤ a0 ≤ a1 ≤ . . . ≤ aj < k. We study the question of how large a power of 2 divides the difference bk(2n) − bk−2(2n) for fixed k ≥ 3, r ≥ 1, and all n ≥ 1.
منابع مشابه
P-partitions revisited
We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.
متن کاملNon-Crossing Partitions in Binary, Ordered and Motzkin Trees
Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...
متن کاملConvexity, Non–Crossing Tree Partitions and Independent Sets in Phylogenetic Trees
Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...
متن کاملRamanujan’s Partial Theta Series and Parity in Partitions
A partial theta series identity from Ramanujan’s lost notebook has a connection with some parity problems in partitions studied by Andrews in [3], where 15 open problems are listed. In this paper, the partial theta series identity of Ramanujan is revisited and answers to Questions 9 and 10 of Andrews are provided.
متن کاملNew Results on Binary Space Partitions in the Plane
We prove the existence of linear size binary space partitions for sets of objects in the plane under certain conditions. In particular, we construct linear size binary space partitions for sets of fat objects, for sets of line segments where the ratio between the lengths of the longest and shortest segment is bounded by a constant, and for homothetic objects. For all cases we also show how to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 98 شماره
صفحات -
تاریخ انتشار 2002